RICE UNIVERSITY B¨ uchi Containment and Size-Change Termination by Seth Fogarty A THESIS SUBMITTED

Source URL: www.cs.rice.edu

• Automata theory
• Models of computation
• Finite-state machine

Algorithmic Analysis of Array-Accessing Programs ? ˇ Rajeev Alur, Pavol Cern´ y, and Scott Weinstein University of Pennsylvania

Source URL: www.cis.upenn.edu

• Mathematics
• Formal languages
• Computer science
• Finite state transducer
• Finite-state machine
• Nondeterministic finite automaton
• Petri net
• FO
• Variable
• Automata theory
• Models of computation
• Theoretical computer science

Turing & Burroughs A Beatnik SF Novel Rudy Rucker Transreal Books

Source URL: www.rudyrucker.com

• Computer science
• Theory of computation
• Alan Turing
• Turing machine
• Entscheidungsproblem
• Edgar Rice Burroughs
• Zeno
• Turing
• Halting problem
• Computability theory
• Theoretical computer science
• Mathematics

2007 Paper 4 Question 6 Computation Theory (a) What does it mean for a set of natural numbers S ⊆ N to be (i ) recursive?

Source URL: www.cl.cam.ac.uk

On Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II Tony Tan School of Informatics, University of Edinburgh Abstract

Source URL: alpha.uhasselt.be

• Computer science
• Pebble automaton
• Regular language
• Turing machine
• Linear temporal logic
• Ω-automaton
• Automata theory
• Theory of computation
• Theoretical computer science

2008 Paper 5 Question 10 Computation Theory (a) The Halting Problem for register machines is unsolvable. State, without proof, a precise form of this result. [3 marks]

Source URL: www.cl.cam.ac.uk

Extending Coq with Imperative Features and its Application to SAT Verification Micha¨el Armand1 , Benjamin Gr´egoire1, Arnaud Spiwack2 , and Laurent Th´ery1 1 INRIA Sophia Antipolis - M´editerran´ee, France,

Source URL: assert-false.net

• Type theory
• Data types
• Computability theory
• Formal methods
• Models of computation
• Lambda calculus
• C++ classes
• Type system
• ALGOL 68
• Software engineering
• Programming language theory
• Computing

Integrating Post-Newtonian Equations on Graphics Processing Units Frank Herrmann Department of Physics, Center for Fundamental Physics, and Center for Scientific Computation and Mathematical Modeling, University of Maryl

Source URL: www.cscamm.umd.edu

• Introductory physics
• Rotational symmetry
• Binary stars
• Angular momentum
• Spin
• General relativity
• Euclidean vector
• Binary black hole
• Gravitational wave
• Physics
• Quantum field theory
• Physical quantities

Evaluating Call-by-need on the Control Stack Stephen Chang, David Van Horn, Matthias Felleisen Northeastern University 1

Source URL: www.ccs.neu.edu

• Computer science
• Computability theory
• Lambda calculus
• Theoretical computer science
• Call stack
• Stack
• Futures and promises
• Eval
• Computing
• Software engineering
• Models of computation

September 21, S0129054112500153:55 WSPC/INSTRUCTION

Source URL: who.rocq.inria.fr

• Computer science
• Theory of computation
• Quantum mechanics
• Alan Turing
• Functional analysis
• Computable function
• Turing machine
• Church–Turing thesis
• Density matrix
• Computability theory
• Theoretical computer science
• Mathematics